Local equivalence of complete bipartite and repeater graph states
نویسندگان
چکیده
منابع مشابه
P 9 - Factorization of Complete Bipartite Graph
Pk -factorization of a complete bipartite graph for k, an even integer was studied by H. Wang [1]. Further, Beiling Du [2] extended the work of H.Wang, and studied the P2k-factorization of complete bipartite multigraph. For odd value of k the work on factorization was done by a number of researchers[3,4,5]. P3-factorization of complete bipartite graph was studied by K.Ushio [3]. P5-factorizatio...
متن کاملOn Subgraphs of the Complete Bipartite Graph
G(n) denotes a graph of n vertices and G(n) denotes its complementary graph. In a complete graph every two distinct vertices are joined by an edge. Let C k (G(n)) denote the number of complete subgraphs of k vertices contained in G(n). Recently it was proved [1] that for every k 2 (n) (1) min C (G (n)) + Ck(G(n)) < k k, , ! 2 2 where the minimum is over all graphs G(n). It seems likely that (1)...
متن کاملCluttered orderings for the complete bipartite graph
To minimize the access cost in large disk arrays (RAID) Cohen et al. [5–7] introduced (d, f)-cluttered orderings of various set systems, d, f ∈ N. In case of a graph this amounts to an ordering of the edge set such that the number of points contained in any d consecutive edges is bounded by the number f . For the complete graph, Cohen et al. gave some optimal solution for small parameters d [5]...
متن کاملThe graph of equivalence classes and Isoclinism of groups
Let $G$ be a non-abelian group and let $Gamma(G)$ be the non-commuting graph of $G$. In this paper we define an equivalence relation $sim$ on the set of $V(Gamma(G))=Gsetminus Z(G)$ by taking $xsim y$ if and only if $N(x)=N(y)$, where $ N(x)={uin G | x textrm{ and } u textrm{ are adjacent in }Gamma(G)}$ is the open neighborhood of $x$ in $Gamma(G)$. We introduce a new graph determined ...
متن کاملUniform coverings of 2-paths in the complete graph and the complete bipartite graph
Let G be a graph and H a subgraph of G. A D(G,H, λ) design is a collection D of subgraphs of G each isomorphic to H so that every 2-path (path of length 2) in G lies in exactly λ subgraphs in D. The problem of constructing D(Kn, Cn, 1) designs is the so-called Dudeney’s round table problem. We denote by Ck a cycle on k vertices and by Pk a path on k vertices. In this paper, we construct D(Kn,n,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 2018
ISSN: 2469-9926,2469-9934
DOI: 10.1103/physreva.98.032305